Automated Manpower Rostering: Techniques and Experience

نویسندگان

  • C. M. KHOONG
  • H. C. LAU
  • L. W. CHEW
چکیده

Manpower is a highly critical resource in many industries. It is not surprising that organizations place substantial investment into manpower management matters. Manpower rostering, which addresses the issues of employing, allocating and scheduling manpower resources to meet operational demands, is at the heart of the manpower management cycle. Rostering is a particularly prominent activity in service organizations where employees need to be scheduled across several workshifts to handle varying customer demands 24 hr a day and seven days a week. The generation of rosters is a complicated process of meeting demands with available resources subject to a variety of work policy constraints and goals. The need for automated manpower rostering systems is thus intuitive and appealing. The system would reduce time spent on creating and modifying rosters for employees, as well as improve on the quality of the rosters, by optimizing manpower employment and deployment costs. Through our contacts, we are aware of some organizations in which a pool of manpower planners spend several days producing each new set of rosters manually, and yet dissatisfactions with the quality of work schedules are routinely expressed by the management and employees. Manpower rostering has been actively researched in the operations research and management science communities for a long time. Popular domains studied in the literature include hospital nurses (Kostreva and Jennings, 1991 ; Miller et al., 1976; Smith and Wiggins, 1977; Warner, 1976), bus drivers (Martello and Toth, 1986; Rousseau, 1984), telephone operators (Henderson and Berry, 1976; Keith, 1979), and airport ground crew (Chew, 1991 ; Holloran and Bryn, 1986). The broad spectrum of domains has led to several distinct solution approaches in the literature, each tailored to a particular class of problems. However, comparatively little work has been done on general models. In this paper, we present R O M A N , a generic toolkit for manpower rostering, developed at the Information Technology Institute in Singapore. The toolkit is a culmination of a year-long applied research effort. Unlike extant systems, R O M A N is designed to address a very wide spectrum of work policies encountered in service organizations. Techniques originating from artificial intelligence, operations research and software engineering arenas are combined into a toolkit that is highly flexible, robust, efficient, customizable and extensible. To date, the toolkit has been licensed to major service organizations in the local health care and transportation sectors. This paper discusses R O M A N in terms of its architectural structure and issues related to its industrial implementation. Analytical modelling and algorithmic aspects in R O M A N will be reviewed only briefly here, since these aspects have been explained in depth in previous publications of the authors (Chew et al., 1991 ; Khoong, 1991 ; Khoong, 1992; Khoong and Lau, 1992). The rest of this paper is organized as follows. In the next section, a generalized view of manpower rostering models is developed. This provides the basis for the discussion of the R O M A N framework in the

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Case-based reasoning in employee rostering: learning repair strategies from domain experts

The development of methods for solving real world scheduling problems such as employee rostering requires the extensive domain knowledge of manual rostering experts. Rostering problems are subject to numerous conflicting constraints and are difficult to solve. Automated rostering has attracted the attention of the scientific community over the last three decades, however the systematic represen...

متن کامل

Comparison of Algorithms for Nurse Rostering Problems

Despite decades of research into automated methods for nurse rostering and some academic successes, one may notice that there is no consistency in the knowledge that has been built up over the years and that many healthcare institutions still resort to manual practices. One of the possible reasons for this gap between the nurse rostering theory and practice is that often the academic community ...

متن کامل

Nurse Rostering and Integer Programming Revisited

Design and development of robust and reliable scheduling algorithms has been an active research area in Computer Science and Artificial Intelligence. Given that the general problem is computationally intractable, many heuristic-based techniques have been developed, while other approaches have used optimising techniques for specific and limited problem domains. In this paper, we consider a large...

متن کامل

A greedy-based neighborhood search approach to a nurse rostering problem

A practical nurse rostering problem, which arises at a ward of an Italian hospital, is considered. The nurse rostering problem is a typical employee timetabling problem, where each month it is required to generate the nursing staff shifts subject to various contractual and operational requirements. These requirements may be in conflict especially for those months in which manpower is reduced du...

متن کامل

Storing and Adapting Repair Experiences in Employee Rostering

The production of effective workforce rosters is a common management problem. Rostering problems are highly constrained and require extensive experience to solve manually. The decisions made by expert rosterers are often subjective and are difficult to represent systematically. This paper presents a formal description of a new technique for capturing rostering experience using case-based reason...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001